Description: 该程序用动态规划解决经典的背包问题,虽然它的效率与分支定界法比起来,还是有一定的差距,但它的简洁性却是无与伦比的.-the program with dynamic programming solution to the classic knapsack problem, although its efficiency and branch and bound over, there is still a certain gap, but its simplicity is incomparable. Platform: |
Size: 3494 |
Author:唐海浪 |
Hits:
Description: knapsack问题的求解.使用vc编程,使问题求解过程可视化-knapsack problem solving. Use vc programming, problem solving process visualization Platform: |
Size: 34816 |
Author:蔡正兴 |
Hits:
Description: 用回朔法实现０－１背包问题，其实排序部分用的是快速排序，以提高运行的时间效率．-Schomburg method used to achieve 0-1 knapsack problem, in fact some sort of rapid, in order to increase the efficiency of operations. Platform: |
Size: 1024 |
Author:郭宏慧 |
Hits:
Description: 使用遗传算法解决经典的背包问题，即整数规划问题。-Using genetic algorithm to solve the classic knapsack problem, that is, the problem of integer programming. Platform: |
Size: 6144 |
Author:王志成 |
Hits:
Description: 用贪婪算法解决背包问题，使用的语言是C语言。写了一个小程序并与传统的程序进行了比较。-Greedy algorithm to solve knapsack problem, the language used is C language. A small program is writen and compared with the traditional procedure were . Platform: |
Size: 1024 |
Author:翟小兵 |
Hits:
Description: 背包问题即给定一组物品，每种物品都有自己的重量和价格，在限定的总重量内，我们如何选择，才能使得物品的总价格最高。-A hybrid algorithm combining ant colony system with multi-choice Knapsack problem was proposed. Platform: |
Size: 1024 |
Author:刘芳 |
Hits:
Search - knapsack problem